Description: 背包问题
采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~
-Knapsack problem using Branch and Bound method to solve 0/1 Knapsack Problem! My internship on the machine operation, through the teacher acceptance, qualified! The machine for some internship students can come to the next ~ Platform: |
Size: 1024 |
Author:ohyoung |
Hits:
Description: 这是非线性整数规划模型求解分支定界迭代算法-This is a non-linear integer programming model to solve iterative algorithm branch and bound Platform: |
Size: 5120 |
Author:王丹 |
Hits:
Description: 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data used in data Platform: |
Size: 264192 |
Author:刘斌 |
Hits:
Description: 在模式识别应用中，用分支定界法(branch-and-board method)进行特征的选择。该程序在matlab环境下实现了该算法，以从六个特征中选择两个最佳特征为例-In pattern recognition applications, using branch and bound method (branch-and-board method) to carry out the characteristics of choice. The program in the matlab environment to achieve the algorithm to select from the following six characteristics of the best features of the two as an example Platform: |
Size: 6144 |
Author:陈坚 |
Hits:
Description: 通过分支限界的方法，求解1到n的最短路径。设数组a保存图的邻接矩阵，0-9号，共10个节点。节点1为源点，n为目标点.-Through the branch and bound approach for solving 1 to n shortest path. A preservation plan for an array of adjacency matrix ,0-9, a total of 10 nodes. Node 1 is the source, n for the target points. Platform: |
Size: 2048 |
Author: |
Hits:
Description: 一个不错的源码，关于分支限界求单源最短路径,java，推荐给大家共享，希望能相互学习-A good source, on the branch and bound for single-source shortest path, java, recommend to all to share, hoping to learn from each other Platform: |
Size: 2048 |
Author:fzb |
Hits:
Description: 分支定界算法C语言实现源程序,标准C源代码，直接可以运行，程序有详细的说明-Branch and bound algorithm for C language source code implementation, the standard C source code can run directly, the program has a detailed description of Platform: |
Size: 146432 |
Author:wanghao |
Hits:
Description: 非线性整数规划算法，求解非线性整数规划活混合规划问题，常用的算法是分枝定界算法。基于该算法编成的现成函数bnb20()-Nonlinear integer programming algorithm for solving nonlinear mixed integer programming live planning problem, commonly used algorithms are branch-and-bound algorithm. Based on the algorithm into off-the-shelf function bnb20 () Platform: |
Size: 138240 |
Author:wangjunxia |
Hits:
Description: Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.
2.If a constant subtracted from any row
or any column of the cost matrix, an
optimal solution does not change. Platform: |
Size: 135168 |
Author:黃文岩 |
Hits:
Description: 分支定界，找出最优解，此编程是以六个特征为例进行编程的。-Branch and bound, to find the optimal solution, this program is based on six characteristics of the program as an example. Platform: |
Size: 3072 |
Author:陈西 |
Hits:
Description: 最优决策——用几个matlab编程的实例阐述分支定界法的思想是：首先确定目标值的上下界-Optimal decision-making- matlab programming with some examples of the branch and bound method is the idea: First, determine the target of the upper and lower bounds Platform: |
Size: 6144 |
Author:陈西 |
Hits:
Description: 分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes. Platform: |
Size: 886784 |
Author:吴男 |
Hits:
Search - branch and bound